Computing Invariants of Multidimensional Linear Systems on an Abstract Homological Level
نویسندگان
چکیده
Methods from homological algebra [16] play a more and more important role in the study of multidimensional linear systems [15], [14], [6]. The use of modules allows an algebraic treatment of linear systems which is independent of their presentations by systems of equations. The type of linear system (ordinary/partial differential equations, timedelay systems, discrete systems. . . ) is encoded in the (noncommutative) ring of (differential, shift, . . . ) operators over which the modules are defined. In this framework, homological algebra gives very general information about the structural properties of linear systems. Homological algebra is a natural extension of the theory of modules over rings. The category of modules and their homomorphisms is replaced by the category of chain complexes and their chain maps. A module is represented by any of its resolutions. The module is then recovered as the only nontrivial homology of the resolution. The notions of derived functors and their homologies, connecting homomorphism and the resulting long exact homology sequences play a central role in homological algebra. The MAPLE-package homalg [1], [2] provides a way to deal with these powerful notions. The package is abstract in the sense that it is independent of any specific ring arithmetic. If one specifies a ring in which one can solve the ideal membership problem and compute syzygies, the above homological algebra constructions over that ring become accessible using homalg. In this paper we introduce the package homalg and present several applications of homalg to the study of multidimensional linear systems using available MAPLE-packages which provide the ring arithmetics, e.g. OREMODULES [4], [5] and JANET [3], [13]. Keywords— Homological algebra, multidimensional linear systems, SMITH normal form, JACOBSON normal form, extension modules, computer algebra.
منابع مشابه
New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملHomological Computations for Term Rewriting Systems
An important problem in universal algebra consists in finding presentations of algebraic theories by generators and relations, which are as small as possible. Exhibiting lower bounds on the number of those generators and relations for a given theory is a difficult task because it a priori requires considering all possible sets of generators for a theory and no general method exists. In this art...
متن کاملA bi-level linear programming problem for computing the nadir point in MOLP
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
متن کاملHomological Algebra and Data
These lectures are a quick primer on the basics of applied algebraic topology with emphasis on applications to data. In particular, the perspectives of (elementary) homological algebra, in the form of complexes and co/homological invariants are sketched. Beginning with simplicial and cell complexes as a means of enriching graphs to higher-order structures, we define simple algebraic topological...
متن کاملIntegrating Policy Iterations in Abstract Interpreters
Among precise abstract interpretation methods developed during the last decade, policy iterations is one of the most promising. Despite its efficiency, it has not yet seen a broad usage in static analyzers. We believe the main explanation to this restrictive use, beside the novelty of the technique, lies in its lack of integration in the classic abstract domain framework. This prevents an easy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006